Rudimentary Reductions Revisited
نویسندگان
چکیده
We show that log-bounded rudimentary reductions (de ned and studied by Jones in 1975) characterize Dlogtime-uniform AC .
منابع مشابه
Metcalfe's Law Revisited
Rudimentary mathematical analysis of simple network models suggests bandwidth-independent saturation of network growth dynamics, as well as hints at linear decrease in information density of the data. However it strongly confirms Metcalfe’s law as a measure of network utility and suggests it can play an important role in network calculations.
متن کاملeb 2 00 2 Energy - dependent potentials revisited : A universal hierarchy of hydrodynamic type ∗
A hierarchy of infinite-dimensional systems of hydrodynamic type is considered and a general scheme for classifying its reductions is provided. Wide families of integrable systems including, in particular, those associated with energy-dependent spectral problems of Schrödinger type, are characterized as reductions of this hierarchy. N -phase type reductions and their corresponding Dubrovin equa...
متن کاملPregnancy in Non-Communicating Rudimentary Horn of A Unicornuate Uterus
Background: Diagnosis and management of pre-rupture stage of the pregnant horn are difficult and usually missed on a routine ultrasound scan. Furthermore, most cases are detected after rupture of pregnant horn. Case: We presented a 28-year-oldG2 L1 woman with diagnosis of RHP at 14 weeks of gestation. She was initially diagnosed with a normal intrauterine pregnancy, whereas a pregnancy in a rig...
متن کاملPlato’s Cave Revisited: Science at the Interface
Scientific exploration and thus our knowledge about the outside world is subject to the conditions of our experience. These conditions are condensed here into an interface model, which, besides being physical, has an additional interface structure not reducible to physics. We suggest that this structure can dynamically be characterized by separate modes, Mi. Their selection and operation presup...
متن کاملUnconditional Tightness Bounds for Generic Reductions: The Exact Security of Schnorr Signatures, Revisited
A long line of research investigates the existence of tight security reductions for the Schnorr signature scheme. Most of these works presented lower tightness bounds, most recently Seurin (Eurocrypt 2012) showed that under certain assumptions the non-tight security proof for Schnorr signatures by Pointcheval and Stern (Eurocrypt 1996) is essentially optimal. All previous works in this directio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 40 شماره
صفحات -
تاریخ انتشار 1991